Approximating the Euclidean distance using non-periodic neighbourhood sequences
نویسندگان
چکیده
منابع مشابه
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
In this paper the nodes of the hexagonal grid are used as points. There are 3 types of neighbours on this grid, therefore neighbourhood sequences contain values 1, 2, 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighbourhood sequences. They can be triangle, hexagon, enneagon and dodecagon. Their corners an...
متن کاملApproximating the Euclidean circle in the square grid using neighbourhood sequences
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the classical neighbourhood relations on digital grids, we get circles that greatly differ from the Euclidean circle. In this paper we examine different methods of ...
متن کاملGenerating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that...
متن کاملProperties of Euclidean and Non-Euclidean Distance Matrices
A distance matrix D of order n is symmetric with elements idfj, where d,, = 0. D is Euclidean when the in(n 1) quantities dij can be generated as the distances between a set of n points, X (n X p), in a Euclidean space of dimension p. The dimensionality of D is defined as the least value of p = rank(X) of any generating X; in general p + 1 and p +2 are also acceptable but may include imaginary ...
متن کاملApproximating evolutionary dynamics on networks using a Neighbourhood Configuration model.
Evolutionary dynamics have been traditionally studied on homogeneously mixed and infinitely large populations. However, real populations are finite and characterised by complex interactions among individuals. Recent studies have shown that the outcome of the evolutionary process might be significantly affected by the population structure. Although an analytic investigation of the process is pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.12.016